منابع مشابه
Solving Generalized Maximum Dispersion with Linear Programming
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the total edge-weight of the induced subgraphs. We present the first LP-based approximation algorithm.
متن کاملProbalilistic Logic Programming under Maximum Entropy
In this paper, we focus on the combination of probabilistic logic programming with the principle of maximum entropy. We start by deening probabilistic queries to probabilistic logic programs and their answer substitutions under maximum entropy. We then present an ef-cient linear programming characterization for the problem of deciding whether a probabilistic logic program is satissable. Finally...
متن کاملCombining probabilistic logic programming with the power of maximum entropy
This paper is on the combination of two powerful approaches to uncertain reasoning: logic programming in a probabilistic setting, on the one hand, and the information-theoretical principle of maximum entropy, on the other hand. More precisely, we present two approaches to probabilistic logic programming under maximum entropy. The first one is based on the usual notion of entailment under maximu...
متن کاملMaximum Entropy method with non-linear moment constraints: challenges
Traditionally, the Method of (Shannon-Kullback’s) Relative Entropy Maximization (REM) is considered with linear moment constraints. In this work, the method is studied under frequency moment constraints which are non-linear in probabilities. The constraints challenge some justifications of REM since a) axiomatic systems are developed for classical linear moment constraints, b) the feasible set ...
متن کاملMaximum entropy estimation in economic models with linear inequality restrictions
In this paper, we use maximum entropy to estimate the parameters in an economic model. We demonstrate the use of the generalized maximum entropy (GME) estimator, describe how to specify the GME parameter support matrix, and examine the sensitivity of GME estimates to the parameter and error bounds. We impose binding inequality restrictions through the GME parameter support matrix and develop a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1990
ISSN: 0895-7177
DOI: 10.1016/0895-7177(90)90127-9